منابع مشابه
H-Coloring dichotomy revisited
The H-Coloring problem can be expressed as a particular case of the Constraint Satisfaction Problem (CSP) whose computational complexity has been intensively studied under various approaches in the last several years. We show that the dichotomy theorem proved by P.Hell and J.Nešetřil [12] for the complexity of the H-Coloring problem for undirected graphs can be obtained using general methods fo...
متن کاملDefective coloring revisited
A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of such colorings in surfaces and the complexity of coloring problems. It is shown that a toroidal graph is (3, 2)and (5, 1)-colorable, and that a graph of genus γ is (χγ/(d + 1) + 4, d)-colorable, where χγ ...
متن کاملGraph Coloring in Optimization Revisited
Algorithms for solving numerical optimization problems and nonlinear systems of equations that rely on derivative information require the repeated estimation of Jacobian and Hessian matrices. The problem of minimizing the number of function evaluations needed to estimate the derivative matrices, within a finite difference method or an automatic differentiation method, has been formulated as a c...
متن کاملA Complexity Dichotomy for the Coloring of Sparse Graphs
Gallucio, Goddyn and Hell proved in 2001 that in any minor-closed class, graphs with large enough girth have a homomorphism to any given odd cycle. In this paper, we study the computational aspects of this problem. We show that for any minor-closed class F containing all planar graphs, and such that all minimal obstructions are 3-connected, the following holds: for any k there is a g = g(F , k)...
متن کاملSolving Dichotomy-based Constrained Encoding With Twin Graph Coloring
Constrained encoding consists of finding a minimum length state encoding that meets some requirements. Dichotomy-based constrained encoding is more general than other constrained encoding frameworks, but it is also more difficult to solve in practice. This paper introduces a new formalization of this problem, which reduces it to what we call a twin graph coloring. This new problem leads to orig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.028